A Functional Interpretation Scheme for D-tree Grammars
نویسنده
چکیده
This paper suggests a new method for interpreting D-Tree Grammar (DTG) derivations that is inspired by ideas from the categorial area. The standard treatment of DTG interpretation is based on the derivation tree (a record of the steps made during the derivation) and requires that the derivation process be constrained in ways that would not otherwise be required. The new method suggested is based on the derived tree, rather than the derivation tree. As such it allows the constraints on the derivation process mentioned to be eliminated, both as an unnecessary complication of the approach and as as obstacle to possible analyses that might be formulated within the framework. A `glue language' style variant of the approach is also described, which makes possible a treatment of quantiication.
منابع مشابه
Alternating Regular Tree Grammars in the Framework of Lattice-Valued Logic
In this paper, two different ways of introducing alternation for lattice-valued (referred to as {L}valued) regular tree grammars and {L}valued top-down tree automata are compared. One is the way which defines the alternating regular tree grammar, i.e., alternation is governed by the non-terminals of the grammar and the other is the way which combines state with alternation. The first way is ta...
متن کاملExploring the Underspeciied World of Lexicalized Tree Adjoining Grammars
This paper presents a precise characterization of the underspeciication found in Lexicalized Tree Adjoining Grammars, and shows that, in a sense, the same degree of underspeciication is found in Lexicalized D-Tree Substitution Grammars. Rather than describing directly the nature of the elementary objects of the grammar, we achieve our objective by formalizing the way in which underspeciication ...
متن کاملPreRkTAG: Prediction of RNA Knotted Structures Using Tree Adjoining Grammars
Background: RNA molecules play many important regulatory, catalytic and structural <span style="font-variant: normal; font-style: norma...
متن کاملProgram analysis and specialisation using tree automata
Static analysis of programs using regular tree grammars has been studied for more than 30 years, the earliest example being Reynolds’ work on automatic derivation of data-type definitions from untyped functional programs. Recently the topic has attracted renewed attention, with applications in program specialisation, data flow analysis, shape analysis, mode and type inference, termination analy...
متن کاملFTAG : current status and parsing scheme
As far as electronic syntactic resources go, one can distinguish rule-based versus statistics-based grammars, as well as program-dependent versus reusable grammars. Lexicalized Tree adjoning grammars (LTAGs) have been used to develop reusable wide-coverage rule-based grammars for different languages (cf. Doran et al. 1994, 1998 for English, Abeillé 1991 and Candito 1999 for French). We describe...
متن کامل